A Novel Acceleration Technique to Improve the Speed of Mining Frequent U2 Patterns

نویسندگان

  • K. S. Kalaivani
  • S. Kuppuswami
چکیده

Frequent pattern mining is the method of finding patterns like itemsets, subsequences and substructures that repeatedly occur in a dataset. In Univariate Uncertain data, each attribute present in a transaction is represented by a quantitative interval and a probability value. U2P-Miner algorithm is used to mine frequent patterns from U2 data. The number of intervals has a great impact on the time taken for mining frequent patterns. A novel acceleration technique which compares the expected support with the user specified threshold is introduced to minimize the number of intervals thereby improving the speed of the mining process. The runtime of the modified U2P-Miner algorithm is compared with the existing U2P-Miner algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Fuzzy Utility Based Frequent Patterns Mining Approach for Mobile Web Services Sequences

Nowadays high fuzzy utility based pattern mining is an emerging topic in data mining. It refers to discover all patterns having a high utility meeting a user-specified minimum high utility threshold. It comprises extracting patterns which are highly accessed in mobile web service sequences. Different from the traditional fuzzy approach, high fuzzy utility mining considers not only counts of mob...

متن کامل

A New Algorithm for High Average-utility Itemset Mining

High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...

متن کامل

Mining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows

Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...

متن کامل

A Monte Carlo simulation technique for assessment of earthquake-induced displacement of slopes

The dynamic response of slopes against earthquake is commonly characterized by the earthquake-induced displacement of slope (EIDS). The EIDS value is a function of several variables such as the material properties, slope geometry, and earthquake acceleration. This work is aimed at the prediction of EIDS using the Monte Carlo simulation method (MCSM). Hence, the parameters height, unit specific ...

متن کامل

Using a Data Mining Tool and FP-Growth Algorithm Application for Extraction of the Rules in two Different Dataset (TECHNICAL NOTE)

In this paper, we want to improve association rules in order to be used in recommenders. Recommender systems present a method to create the personalized offers. One of the most important types of recommender systems is the collaborative filtering that deals with data mining in user information and offering them the appropriate item. Among the data mining methods, finding frequent item sets and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013